Surfaces of small diameter with large width
نویسندگان
چکیده
منابع مشابه
Regular Maps on Surfaces with Large Planar Width
A map is a cell decomposition of a closed surface; it is regular if its automorphism group acts transitively on the flags, mutually incident vertex-edge-face triples. The main purpose of this paper is to establish, by elementary methods, the following result: for each positive integer w and for each pair of integers p ≥ 3 and q ≥ 3 satisfying 1/p + 1/q ≤ 1/2, there is an orientable regular map ...
متن کاملConvex Sets of Constant Width and -diameter
PETER HÄSTÖ, ZAIR IBRAGIMOV AND DAVID MINDA ABSTRACT. In this article we study -diameter of planar sets of constant width. We obtain analogues of the isodiametric inequality and the Blaschke-Lebesgue Theorem for -diameter of constant width sets. Namely, we prove that among all the sets of given constant width, disks have the smallest -diameter and Reuleaux triangles have the largest -diameter. ...
متن کاملTree-decompositions with bags of small diameter
This paper deals with the length of a Robertson–Seymour’s tree-decomposition. The tree-length of a graph is the largest distance between two vertices of a bag of a tree-decomposition, minimized over all tree-decompositions of the graph. The study of this invariant may be interesting in its own right because the class of bounded tree-length graphs includes (but is not reduced to) bounded chordal...
متن کاملSuperconnectivity of regular graphs with small diameter
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D ≤ g − 2, then the graph is super-κ when g ≥ 5 and a complete graph otherwise.
متن کاملThe number of digraphs with small diameter
k) denote the l1um ber of of order nand diam-In this paper it is that: fixed k :~, ii) for every fixed k 1, n! where with D(n;d=n k:):Sn! (n) are polynomials of degree k 1 in n coefficients depending only on k. c;o:rres1)(:m(img results for undirected graphs given in [2]. of a vertex :r is the number of vertices of CJ that nr1PO'l'PP d-(x) is the number of vertices of G ~UII~~'~HU connected dig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Topology and Analysis
سال: 2014
ISSN: 1793-5253,1793-7167
DOI: 10.1142/s1793525314500149